Three-Dimensional Delaunay Mesh Generation

نویسندگان

  • Siu-Wing Cheng
  • Sheung-Hung Poon
چکیده

We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain specified by a piecewise linear complex. Arbitrarily small input angles are allowed, and the input complex is not required to be a manifold. Our algorithm encloses the input edges with a small buffer zone, a union of balls whose sizes are proportional to the local feature sizes at their centers. In the output mesh, the radius-edge ratio of the tetrahedra outside the buffer zone is bounded by a constant independent of the domain, while that of the tetrahedra inside the buffer zone is bounded by a constant depending on the smallest input angle. Furthermore, the output mesh is graded. Our work is the first that provides quality guarantees for Delaunay meshes in the presence of small input angles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Delaunay Tetrahedralization using an Advancing-Front Approach

This paper presents a procedure for eecient generation of three-dimensional unstructured meshes of tetrahedral elements. Initially, a constrained Delaunay mesh is generated wherein internal points are created using advancing-front point placement and are inserted using a Delaunay method. The overall procedure is applied repetitively until the mesh satisses a desired element size distribution fu...

متن کامل

Parallel Two-Dimensional Unstructured Anisotropic Delaunay Mesh Generation for Aerospace Applications

PARALLEL TWO-DIMENSIONAL UNSTRUCTURED ANISOTROPIC DELAUNAY MESH GENERATION FOR AEROSPACE APPLICATIONS Juliette Kelly Pardue Old Dominion University, 2015 Director: Dr. Andrey Chernikov A bottom-up approach to parallel anisotropic mesh generation is presented by building a mesh generator from the principles of point-insertion, triangulation, and Delaunay refinement. Applications focusing on high...

متن کامل

A new conforming mesh generator for three-dimensional discrete fracture networks

Nowadays, numerical modelings play a key role in analyzing hydraulic problems in fractured rock media. The discrete fracture network model is one of the most used numerical models to simulate the geometrical structure of a rock-mass. In such media, discontinuities are considered as discrete paths for fluid flow through the rock-mass while its matrix is assumed impermeable. There are two main pa...

متن کامل

Conforming restricted Delaunay mesh generation for piecewise smooth complexes

A Frontal-Delaunay refinement algorithm for mesh generation in piecewise smooth domains is described. Built using a restricted Delaunay framework, this new algorithm combines a number of novel features, including: (i) an unweighted, conforming restricted Delaunay representation for domains specified as a (non-manifold) collection of piecewise smooth surface patches and curve segments, (ii) a pr...

متن کامل

Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery

In two dimensions, a constrained Delaunay triangulation (CDT) respects a set of segments that constrain the edges of the triangulation, while still maintaining most of the favorable properties of ordinary Delaunay triangulations (such as maximizing the minimum angle). CDTs solve the problem of enforcing boundary conformity—ensuring that triangulation edges cover the boundaries (both interior an...

متن کامل

Three-Dimensional Delaunay Mesh Generation Using a Modi ed Advancing Front Approach

We introduce a meshing method which uses an advancing front Delaunay algorithm. The presented Delaunay technique avoids the need for a temporary tetrahedralization of the convex hull and a later following segmentation step which is typical for commonly used methods. The algorithm is suitable for local regridding applications. This is an important issue for element quality improvements and for m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2006